a = input()
dic = {'1':1,'2':2,'3':6,'4':20,'5':70,'6':252,'7':924,'8':3432,'9':12870,'10':48620}
print(dic[a])
#include<bits/stdc++.h>
#define endl "\n"
#define Om25r cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
using namespace std;
typedef long long ll;
int main()
{
Om25r
int n; cin>>n;
int arr[n][n];
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
arr[i][j]=1;
}
}
for(int i=1; i<n; i++){
for(int j=1; j<n; j++){
arr[i][j] = arr[i-1][j] + arr[i][j-1];
}
}
cout<<arr[n-1][n-1]<<endl;
return 0;
}
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |